Towards Heuristic Algorithmic Memory

نویسنده

  • Eray Özkural
چکیده

We propose a long-term memory design for artificial general intelligence based on Solomonoff’s incremental machine learning methods. We introduce four synergistic update algorithms that use a Stochastic Context-Free Grammar as a guiding probability distribution of programs. The update algorithms accomplish adjusting production probabilities, re-using previous solutions, learning programming idioms and discovery of frequent subprograms. A controlled experiment with a long training sequence shows that our incremental learning approach is

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algorithmic Support for Video-on-Demand based on the Delayed-multicast Protocol

In this paper, we examine algorithmic issues related to the delayed multicast technique [8] for Video-on-Demand delivery. We introduce the minimum total memory (MTM), minimum total traffic (MTT), and the minimum maximum memory per node (MMMN) delayed-multicast allocation problems. We provide polynomial time algorithms for solving the MTM and the MTT problems on the chandelier network and the MT...

متن کامل

Video-on-Demand Based on Delayed-Multicast: Algorithmic Support

In this paper, we examine algorithmic issues related to the delayed multicast technique for video-ondemand delivery. We introduce the minimum total memory (MTM), minimum total traffic (MTT) and the minimum maximum memory per node (MMMN) delayed-multicast allocation problems. We examine these problems on two networks of practical interest, namely, the chandelier and the broom networks. We provid...

متن کامل

Improving SAT Solver Efficiency Using a Multi-Core Approach

Many practical problems in multiple fields can be converted to a SAT problem, or a sequence of SAT problems, such that their solution immediately implies a solution to the original problem. Despite the enormous progress achieved over the last decade in the development of SAT solvers, there is strong demand for higher algorithm efficiency to solve harder and larger problems. The widespread avail...

متن کامل

Learning to prove: The idea of heuristic examples

Proof is an important topic in the area of mathematics curriculum and an essential aspect of mathematical competence. However, recent studies have revealed wide gaps in student's understanding of proof. Furthermore, effective teaching to prove, for example, by Schoenfeld's approach, is a real challenge for teachers. A very powerful and empirically well founded method of learning mathematics, wh...

متن کامل

Two approximation algorithms for bipartite matching on multicore architectures

We propose two heuristics for the bipartite matching problem that are amenable to shared-memory parallelization. The first heuristic is very intriguing from a parallelization perspective. It has no significant algorithmic synchronization overhead and no conflict resolution is needed across threads. We show that this heuristic has an approximation ratio of around 0.632 under some common conditio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011